Improved Bounds on Sidon Sets via Lattice Packings of Simplices
نویسندگان
چکیده
A Bh set (or Sidon set of order h) in an Abelian group G is any subset {b0, b1, . . . , bn} ⊂ G with the property that all the sums bi1 + · · ·+ bih are different up to the order of the summands. Let φ(h, n) denote the order of the smallest Abelian group containing a Bh set of cardinality n+1. It is shown that, as h → ∞ and n is kept fixed, φ(h, n) ∼ 1 n! δl(△) h n , where δl(△ ) is the lattice-packing density of an n-simplex in the Euclidean space. This determines the asymptotics exactly in cases where this density is known (n ≤ 3), and gives an improved upper bound on φ(h, n) in the remaining cases. Covering analogs of Sidon sets are also introduced and their characterization in terms of lattice-coverings by simplices is given. 1. Preliminaries 1.1. Bh sets. Let G be a finite additive Abelian group, and h and n positive integers. A set B = {b0, b1, . . . , bn} ⊂ G is said to be a Bh set (or Sidon set of order h) if all the sums bi1 + · · · + bih with 0 ≤ i1 ≤ · · · ≤ ih ≤ n are different. If B is a Bh set, then so is B − b0 ≡ {0, b1 − b0, . . . , bn − b0}, and vice versa; therefore, we shall assume in the sequel that b0 = 0. With this convention B is a Bh set if and only if the sums α1b1 + · · ·+ αnbn are different for every choice of the coefficients αi ∈ Z, αi ≥ 0, ∑ n i=1 αi ≤ h (here αibi denotes the sum of αi copies of the element bi ∈ G). Let φ(h, n) denote the order of the smallest Abelian group containing a Bh set of cardinality n + 1. Understanding the dependence of φ(h, n) on the parameters h and n, and in particular its asymptotic behavior in various regimes when h·n → ∞, are among the most important problems in the study of Bh sets. We are interested here in the behavior of φ(h, n) as h → ∞ and n is kept fixed. The following bounds are known: (1.1) (2n)! 2n(n!)3 (h− 2n+ 2) < φ(h, n) ≤ (h+ 1), where the left-hand inequality [9] holds for 0 ≤ 2n− 2 ≤ h, and the right-hand inequality [8] for all positive h, n. In particular, (1.2) (2n)! 2n(n!)3 ≤ lim h→∞ φ(h, n) h ≤ 1. Date: October 6, 2016. 2010 Mathematics Subject Classification. 05B10, 05B40, 11B75, 11B83, 11H31, 52C17, 20K99.
منابع مشابه
Sidon Sets in N
We study finite and infinite Sidon sets in N. The additive energy of two sets is used to obtain new upper bounds for the cardinalities of finite Sidon subsets of some sets as well as to provide short proofs of already known results. We also disprove a conjecture of Lindstrom on the largest Sidon set in [1, N ]× [1, N ] and relate it to a known conjecture of Vinogradov concerning the size of the...
متن کاملOn Lower Bounds of the Density of Delone Sets and Holes in Sequences of Sphere Packings
We study lower bounds of the packing density of a system of nonoverlapping equal spheres in Rn, n ≥ 2, as a function of the maximal circumradius of its Voronoi cells. Our viewpoint is that of Delone sets which allows to investigate the gap between the upper bounds of Rogers or Kabatjanskĭi-Levens̆tein and the Minkowski-Hlawka type lower bounds for the density of lattice-packings, without enterin...
متن کاملThe weighted coordinates bound and trellis complexity of block codes and periodic packings
Weighted entropy profiles and a new bound, the weighted coordinates bound, on the state complexity profile of block codes are presented. These profiles and bound generalize the notion of dimension/length profile (DLP) and entropy/length profile (ELP) to block codes whose symbols are not drawn from a common alphabet set, and in particular, group codes. Likewise, the new bound may improve upon th...
متن کاملVolume and Lattice Points of Reflexive Simplices
Using new number-theoretic bounds on the denominators of unit fractions summing up to one, we show that in any dimension d ≥ 4 there is only one d-dimensional reflexive simplex having maximal volume. Moreover, only these reflexive simplices can admit an edge that has the maximal number of lattice points possible for an edge of a reflexive simplex. In general, these simplices are also expected t...
متن کاملAn Introduction to Empty Lattice Simplices
We study simplices whose vertices lie on a lattice and have no other lattice points. Suchèmpty lattice simplices' come up in the theory of integer programming, and in some combi-natorial problems. They have been investigated in various contexts and under varying terminology Can thèemptiness' of lattice simplices bèwell-characterized' ? Is theirìattice-width' small ? Do the integer points of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 31 شماره
صفحات -
تاریخ انتشار 2017